#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e3+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
int main(void)
{
  	cin.tie(0);std::ios::sync_with_stdio(false);
    LL n,k,p,x,y;cin>>n>>k>>p>>x>>y;
    for(LL i=1;i<=k;i++){
        cin>>a[i];
    }
    sort(a+1,a+1+k);
    LL midnum=n/2;
    for(LL i=1;i<=k;i++){
        if(a[i]<y) midnum--;
    }
    if(midnum<0){
        cout<<"-1"<<"\n";
    }
    else{
        for(LL i=k+1;i<=n;i++){
            if(midnum>0) a[i]=1,midnum--;
            else a[i]=y;
        }
        LL sum=0;
        for(LL i=1;i<=n;i++){
            sum+=a[i];
        }
        if(sum>x){
            cout<<"-1"<<"\n";
        }
        else{
            for(LL i=k+1;i<=n;i++){
                cout<<a[i]<<" ";
            }
            cout<<"\n";
        }
    }
return 0;
}
